About the Course
Data structures and algorithms are fundamental concepts in computer science, working together to efficiently store, organize, and process data
-
Introduction
-
Recursion
-
Algorithm Runtime Analysis
-
Arrays
-
What and Why of Array -
Types of Array
-
How is Array represented in Memory
-
Create an Array
-
Insert Traverse in 1D Array
-
. Access Search Delete in 1D Array
-
Code 1D Array
-
Time Complexity of 1D Array
-
Create 2D Array
-
2D Array operations
-
Time Complexity of 2D Array
-
When to use Array
-
Code 2D Array
-
Practical uses of Array
-
-
Algorithm Techniques
-
LinkedList
-
What is linked list
-
Linked list vs Array
-
Components of LinkedList
-
Types of LinkedList
-
Why so many types of LinkedList
-
How is LinkedList stored in Memory
-
Creation of Single LinkedList (SLL)
-
Insertion in SLL - Dry Run
-
Insertion in SLL - Algo
-
Traversal of SLL
-
Search node in SLL
-
Deletion of node from SLL - Dry Run
-
Deletion of node from SLL - Algo
-
Delete entire SLL
-
Time Complexity of SLL
-
Insertion of data in CSLL - Dry Run
-
Insertion of data in CSLL - Algo
-
Traverse CSLL
-
Search a node in CSLL
-
Delete a node from CSLL - Dry Run
-
Deletion of node from CSLL - Algo
-
Deletion of entire CSLL
-
Time Complexity of CSLL
-
Create Double Linked List (DLL)
-
Insert node in DLL - Dry Run
-
Insert node in DLL - Algo
-
Traverse DLL
-
Reverse Traversal of DLL
-
Search a node in DLL
-
Delete a node from DLL - Dry Run
-
Delete a node from DLL - Algo
-
Delete entire DLL
-
Time Complexity of DLL
-
Create Double Circular LinkedList (CDLL)
-
Insert node in CSLL Dry Run
-
Insert node in CSLL Algo
-
Traverse CSLL
-
Search a node in CSLL
-
Delete a node from CSLL Dry Run
-
Delete a node from CSLL Algo
-
Delete entire CSLL
-
Time Complexity of CSLL
-
Create Double Linked List (DLL)
-
-
Graphs
-
Sorting
-
Binary Tree
-
Hashing
-
Stack
-
Queue
-
What and Why of Queue
-
LINEAR QUEUE(Array) - Create, Enqueue
-
LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete
-
Why Circular Queue
-
CIRCULAR QUEUE(Array) - Enqueue
-
CIRCULAR QUEUE(Array) - Dequeue
-
CIRCULAR QUEUE(Array) - Peek, isEmpty, isFull, Delete
-
LINEAR QUEUE(LL) - Enqueue
-
LINEAR QUEUE(LL) - DeQueue
-
Array vs LinkedList Implementation
-